Fast heart rate extraction using CW Doppler radar with interpolated discrete Fourier transform algorithm

Molecular Simulation with Discrete Fast Fourier Transform

Very fast discrete Fourier transform, using number theoretic transform

It is shown that number theoretic transforms (NTT) can be used to compute discrete Fourier transform (DFT) very efficiently. By noting some simple properties of number theory and the DFT, the total number of real multiplications for a length-P DFT is reduced to (P — 1). This requires less than one real multiplication per point. For a proper choice of transform length and NTT, the number of shif...

Using a Fast Fourier Transform Algorithm

The symmetry and periodicity properties of the discrete Fourier transform (DFT) allow a variety of useful and interesting decompositions. In particular, by clever grouping and reordering of the complex exponential multiplications it is possible to achieve substantial computational savings while still obtaining the exact DFT solution (no approximation required). Many “fast” algorithms have been ...

Doppler Radar Architectures and Signal Processing for Heart Rate Extraction

In this paper heartbeat interval extraction methods using Doppler radar are reviewed. While single channel CW radar offers simple architecture and signal processing, this method is very sensitive to subject position. Quadrature radio architecture is used to overcome this limitation. The use of linear and non-linear demodulation methods was explored for heartbeat interval extraction, and it was ...

A fast algorithm for multiresolution discrete Fourier transform

The paper presents a fast algorithm for the calculation of a multiresolution discrete Fourier transform. The presented approach is based on the realization of the Fast Fourier Transform for each frequency resolution level. This algorithm allows reducing the number of complex multiplications and additions compared to the method consisting in the multiplication between the input signal expressed ...